Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
نویسندگان
چکیده
منابع مشابه
The Hyper-Zagreb Index of Graph Operations
Let G be a simple connected graph. The first and second Zagreb indices have been introduced as vV(G) (v)2 M1(G) degG and M2(G) uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G) (degG(u) degG In this paper, the HyperZagreb index of the Cartesian p...
متن کاملA note on hyper-Zagreb index of graph operations
In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].
متن کاملThe hyper-Wiener index of graph operations
Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=12W(G)+12@?"{"u","v"}"@?"V"("G")d (u,v)^2. In this paper the hyper-Wiener indices of the Cartesian product, composition,...
متن کاملthe hyper-zagreb index of graph operations
let g be a simple connected graph. the first and second zagreb indices have been introducedas vv(g)(v)2 m1(g) degg and m2(g) uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g) (degg(u) degg inthis paper, the hyperzagreb index of the cartesian product...
متن کاملON THE MAXIMUM AND MINIMUM FIRST REFORMULATED ZAGREB INDEX OF GRAPHS WITH CONNECTIVITY AT MOST k
The authors Miličević et al. introduced the reformulated Zagreb indices [1], which is a generalization of classical Zagreb indices of chemical graph theory. In this paper, we mainly consider the maximum and minimum for the first reformulated index of graphs with connectivity at most k. The corresponding extremal graphs are characterized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.05.001